Quantum annealing correction with minor embedding
نویسندگان
چکیده
منابع مشابه
Adiabatic quantum programming: minor embedding with hard faults
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Thesemethods ext...
متن کاملError correction for encoded quantum annealing
Recently, Lechner, Hauke and Zoller [1] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all pairwise connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise, and we analyze the code’s performance...
متن کاملMinor-embedding in adiabatic quantum computation: II. Minor-universal graph design
In [6], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such that G can be obtained from it by contracting edges. In this paper, we describe the intertwined adiabatic quantum architecture design problem, which is to construct a hardware graph U that satisfies all known physical constra...
متن کاملError correction for a proposed quantum annealing architecture
Recently, Lechner, Hauke and Zoller [1] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise. Quantum annealing [2] is a method for solving ...
متن کاملA Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid quantum-classical regime. This realisation has led to interest in hybrid quantum-classical algorithms allowing, for example, quantum computers to solve large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2015
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.92.042310